A Fast Monte Carlo Method Based on an Acceptance-Rejection Scheme for Particle Coagulation
نویسنده
چکیده
A fast acceptance-rejection scheme that can boost the performance of Monte Carlo methods for particle coagulation has been designed and validated in this article. The central idea behind this scheme is to perform a fast evaluation of the maximum coagulation rate by making full use of the information of those particle pairs that are already generated to determine the desired coagulation pair. To this end, numerical experiments are carried out to establish a connection between the average coagulation rate obtained from information of those already generated particle pairs and the maximum coagulation rate. The correctness of the proposed scheme is then validated by comparing it to some established methods, adopting a physically realistic Brownian coagulation kernel. The computational efficiency of the fast AR scheme is finally measured.
منابع مشابه
Sequential Monte Carlo with Adaptive Weights for Approximate Bayesian Computation
Methods of Approximate Bayesian computation (ABC) are increasingly used for analysis of complex models. A major challenge for ABC is over-coming the often inherent problem of high rejection rates in the accept/reject methods based on prior:predictive sampling. A number of recent developments aim to address this with extensions based on sequential Monte Carlo (SMC) strategies. We build on this h...
متن کاملAn Approach in Radiation Therapy Treatment Planning: A Fast, GPU-Based Monte Carlo Method
Introduction: An accurate and fast radiation dose calculation is essential for successful radiation radiotherapy. The aim of this study was to implement a new graphic processing unit (GPU) based radiation therapy treatment planning for accurate and fast dose calculation in radiotherapy centers. Materials and Methods: A program was written for parallel runnin...
متن کاملDelayed acceptance particle MCMC for exact inference in stochastic biochemical network models
Recently proposed particle MCMCmethods provide a flexible way of performing Bayesian inference for parameters governing stochastic kinetic models defined as Markov jump processes (MJPs). Each iteration of the scheme requires an estimate of the marginal likelihood calculated from the output of a sequential Monte Carlo scheme (also known as a particle filter). Consequently, the method can be extr...
متن کاملDirect simulation Monte Carlo schemes for Coulomb interactions in plasmas
We consider the development of Monte Carlo schemes for molecules with Coulomb interactions. We generalize the classic algorithms of Bird and Nanbu-Babovsky for rarefied gas dynamics to the Coulomb case thanks to the approximation introduced by Bobylev and Nanbu [1]. Thus, instead of considering the original Boltzmann collision operator, the schemes are constructed through the use of an approxim...
متن کاملMonte Carlo Integration With Acceptance-Rejection
This article considers Monte Carlo integration under rejection sampling or Metropolis-Hastings sampling. Each algorithm involves accepting or rejecting observations from proposal distributions other than a target distribution. While taking a likelihood approach, we basically treat the sampling scheme as a random design, and define a stratified estimator of the baseline measure. We establish tha...
متن کامل